Universal Hashing and Multiple Authentication
نویسندگان
چکیده
In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the univcrsal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for mthenticatmion codes. Then we gencralize the theory of universal hashing in order t,o accommodate the situation where we would like to authenticate a sequence of messages with the Sam: key. Unlike previous methods for doing this, we do not rcquire that each message in the sequence have a “countcr” attached to it.
منابع مشابه
Image authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملCompressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملShort-Output Universal Hash Functions and Their Use in Fast and Secure Data Authentication
Message authentication codes usually require the underlining universal hash functions to have a long output so that the probability of successfully forging messages is low enough for cryptographic purposes. To take advantage of fast operation on word-size parameters in modern processors, long-output universal hashing schemes can be securely constructed by concatenating several different instanc...
متن کاملShort-output universal hash functions and their use in fast and secure message authentication
Message authentication codes usually require the underlining universal hash functions to have a long output so that the probability of successfully forging messages is low enough for cryptographic purposes. To take advantage of fast operation on word-size parameters in modern processors, long-output universal hashing schemes can be securely constructed by concatenating several instances of shor...
متن کامل